Some Algorithms for Nilpotent Permutation Groups

On minimal degrees of faithful quasi-permutation representations of nilpotent groups

By a quasi-permutation matrix, we mean a square non-singular matrix over the complex field with non-negative integral trace....

Some Inequalities for Nilpotent Multipliers of Powerful p-Groups

(c,1,...,1) Polynilpotent Multiplier of some Nilpotent Products of Groups

In this paper we determine the structure of (c,1,...,1) polynilpotent multiplier of certain class of groups. The method is based on the characterizing an explicit structure for the Baer invariant of a free nilpotent group with respect to the variety of polynilpotent groups of class row (c,1,...,1).

Minimal Permutation Representations of Nilpotent Groups

A minimal permutation representation of a finite group G is a faithful G-set with the smallest possible size. We study the structure of such representations and show that for certain groups they may be obtained by a greedy construction. In these situations (except when central involutions intervene) all minimal permutation representations have the same set of orbit sizes. Using the same ideas w...

On the tenacity of cycle permutation graph

A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.